import sys, os, io
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ca, cb = [0] * 2, [0] * 2
for i in a:
ca[i % 2] += 1
for i in b:
cb[i % 2] += 1
ans = 0
for i in range(2):
ans += min(ca[i], cb[i ^ 1])
print(ans)#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n,m,a[100100],b[100100];
ll ev1=0,ev2=0,od1=0,od2=0,ans=0;
cin>>n>>m;
for(int i=0;i<n;i++)
{
cin>>a[i];
if(a[i]%2==0)
ev1++;
else
od1++;
}
for(int i=0;i<m;i++)
{
cin>>b[i];
if(b[i]%2==0)
ev2++;
else
od2++;
}
ans=min(ev1,od2)+min(od1,ev2);
cout<<ans<<endl;
return 0;
}1566B - MIN-MEX Cut | 678C - Joty and Chocolate |
1352E - Special Elements | 1520E - Arranging The Sheep |
1157E - Minimum Array | 1661D - Progressions Covering |
262A - Roma and Lucky Numbers | 1634B - Fortune Telling |
1358A - Park Lighting | 253C - Text Editor |
365B - The Fibonacci Segment | 75A - Life Without Zeros |
1519A - Red and Blue Beans | 466A - Cheap Travel |
659E - New Reform | 1385B - Restore the Permutation by Merger |
706A - Beru-taxi | 686A - Free Ice Cream |
1358D - The Best Vacation | 1620B - Triangles on a Rectangle |
999C - Alphabetic Removals | 1634C - OKEA |
1368C - Even Picture | 1505F - Math |
1473A - Replacing Elements | 959A - Mahmoud and Ehab and the even-odd game |
78B - Easter Eggs | 1455B - Jumps |
1225C - p-binary | 1525D - Armchairs |